Constraint 2 is not relaxed
Constraint 3 is relaxed
Constraint 4 is not relaxed
Constraint 5 is not relaxed
Constraint 6 is not relaxed
The time to read the input and initialise the problem = 344 ms

Iteration 1
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 94 ms
The lower bound solution is:
z = -12570.000000
The time to read the lower bound solution = 0 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 74208.000000
The optimal solution has not been found yet.

Iteration 2
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 4397.039999
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 77375.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 3
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 13416.675200
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 4
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 20711.634176
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 5
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 27131.198076
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 6
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 32780.414306
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 7
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 37751.724591
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 8
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 42126.477637
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 9
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 44637.130160
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 10
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 46411.382352
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 11
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 48079.179411
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 12
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 49646.908645
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 13
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 49066.348542
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 93613.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 14
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 48707.179931
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 15
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50180.845414
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 16
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50233.543768
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 93613.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 17
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 49266.723774
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 18
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50705.191149
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 19
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50284.913117
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 20
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 49052.690736
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 21
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50834.005289
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 22
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 48172.589963
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 23
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50321.812411
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 24
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50523.731023
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 25
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 48680.720282
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 26
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50829.942730
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 27
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50213.456756
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 28
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 49188.850603
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 29
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50759.539465
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 30
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 48294.541239
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 31
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50443.763688
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 32
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50449.265199
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 33
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 48802.671562
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 34
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50951.894007
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 35
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 50143.310041
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 36
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = 49321.242565
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 37
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50686.638535
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 38
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 48431.443727
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 39
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50567.662689
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 40
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50377.929164
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 41
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 48937.011247
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 42
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50921.257658
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 43
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 48047.212409
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 44
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50183.431374
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 45
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50612.548286
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 46
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 48552.779932
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 47
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50688.998897
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 48
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50303.838915
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 49
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 49058.347455
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 50
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50847.167409
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 51
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 48168.548617
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 52
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50304.767581
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 53
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50538.458037
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 54
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 48674.116139
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 55
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50810.335102
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 56
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50229.748665
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 57
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 49179.683660
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 58
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50773.077159
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 59
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 48289.884822
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 60
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50426.103786
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 61
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50464.367788
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 62
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 48795.452344
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 63
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50931.671307
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 64
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50155.658416
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 65
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 49301.019865
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 66
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50698.986910
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 67
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 48411.221027
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 68
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50547.439988
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 69
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50390.277539
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 70
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 48916.788546
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 71
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50933.606033
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 72
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 48026.989708
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 73
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50163.208673
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 74
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50624.896661
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 75
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 48532.557231
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 76
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50668.776194
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 77
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50316.187290
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 78
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 49038.124752
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 79
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50859.515784
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 80
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 48148.325914
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 81
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50284.544880
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 82
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50976.825345
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 83
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 49685.571105
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 84
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50537.805587
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 85
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50822.636132
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 86
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 49938.083873
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 87
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50790.318354
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 88
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50668.446920
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 89
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50190.596643
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 90
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50939.819934
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 91
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 49746.174169
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 92
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50598.408651
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 93
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50785.630721
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 94
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 49998.686938
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 95
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50850.921419
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 96
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50631.441509
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 97
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50251.199707
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 98
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50902.814523
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 99
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 49806.777234
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 100
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50659.011716
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 101
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50748.625310
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 102
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50059.290004
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 103
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50911.524484
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 104
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50594.436098
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 105
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50311.802770
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 106
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50865.809112
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 107
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 49867.380298
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 108
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50719.614780
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 109
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50711.619900
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 110
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50119.893067
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 111
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50972.127549
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 112
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50557.430687
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 113
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50372.405836
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 114
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50828.803701
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 115
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 49927.983364
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 116
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50780.217845
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 117
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50674.614489
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 118
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50180.496133
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 119
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50945.987502
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 120
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 49736.073659
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 121
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50588.308141
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 122
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50791.798290
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 123
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 49988.586430
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 124
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50840.820908
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 125
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50637.609078
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 126
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50241.099196
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 127
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50908.982091
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 128
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 49796.676724
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 129
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = 50648.911206
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 130
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50754.792879
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 131
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50049.189494
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 132
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50901.423970
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 133
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50600.603667
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 134
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50301.702261
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 135
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50871.976680
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 136
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 49857.279790
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 137
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50709.514268
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 138
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50717.787468
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 139
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50109.792558
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 140
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 50962.027038
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 141
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50563.598256
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 142
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50362.305324
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 143
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50834.971269
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 144
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 49917.882853
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 145
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 50770.117331
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 146
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50680.782057
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 147
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50170.395620
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 148
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50952.155071
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 149
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 49725.973150
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 150
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50578.207628
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 151
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50797.965858
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 152
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 49978.485917
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 153
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50830.720397
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 32 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 154
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50643.776646
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 155
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50230.998686
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 156
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50915.149660
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 157
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 49786.576212
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 158
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50638.810692
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 159
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50760.960447
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 160
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50039.088982
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 161
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50891.323461
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 162
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 50819.552348
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 163
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50669.112227
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 164
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51017.579847
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 165
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51091.298645
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 166
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50643.709702
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 167
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51144.319874
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 168
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50948.226090
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 169
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50826.558378
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 170
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51016.244151
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 171
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50661.861216
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 172
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51049.056850
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 173
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50873.015230
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 174
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50828.447733
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 175
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51174.402934
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 176
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51142.707211
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 177
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50679.088161
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 178
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51210.636552
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 179
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50515.951572
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 180
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51079.610746
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 181
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51067.819466
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 182
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50696.688427
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 32 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 183
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51135.641951
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 184
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50532.464832
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 185
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50984.621638
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 186
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50992.824868
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 187
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50713.201686
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 188
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51060.647348
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 189
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50544.672076
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 190
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50889.632529
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 191
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51234.592980
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 192
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51118.868973
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 193
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50730.245363
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 194
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51186.620807
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 195
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50566.192839
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 196
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51139.702820
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 197
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51043.952495
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 198
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50746.741419
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 199
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51111.704327
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 200
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50582.688895
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 201
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51044.812660
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 202
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50969.036015
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 203
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50763.237474
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 204
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51036.787850
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 205
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50599.184952
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 206
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50949.922502
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 207
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50894.119539
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 208
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50730.176868
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 209
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51074.777975
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 210
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51162.481460
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 211
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50615.681007
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 212
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51199.633448
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 213
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51019.813147
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 214
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50796.229589
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 215
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51087.564982
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 216
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50632.177066
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 217
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51104.743290
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 218
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50944.896672
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 219
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50812.725647
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 220
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51012.648503
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 221
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50648.673121
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 222
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51009.853128
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 223
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50869.980191
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 224
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50790.107496
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 225
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51134.708602
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 226
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51138.342115
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 227
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50665.169178
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 228
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51206.093946
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 229
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 50501.116653
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 230
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51039.818443
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 231
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51063.425635
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 232
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50681.665233
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 233
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51131.177467
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 234
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 50517.612708
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 235
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50944.928283
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 236
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50988.509155
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 237
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50698.161292
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 238
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51056.260989
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 239
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50505.437020
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 240
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 50850.038125
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 241
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51194.639228
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 242
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51219.412841
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 243
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50968.984161
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 244
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51253.288757
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 245
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50887.305089
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 246
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51147.283562
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 247
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51182.012653
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 248
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50977.505915
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 249
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51209.660496
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 250
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51110.736550
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 251
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51067.706742
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 252
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51144.584898
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 253
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50985.747230
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 254
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51162.254027
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 255
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51073.308793
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 256
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51052.470624
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 257
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51224.630959
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 258
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51207.380559
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 259
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50993.988545
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 260
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = 51241.228907
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 261
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50912.029036
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 262
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51177.224492
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 263
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51169.952801
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 264
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51002.229862
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 265
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51203.801150
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 266
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50920.270351
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 267
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51129.818024
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 268
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51132.525045
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 269
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51010.471177
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 270
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51166.373394
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 271
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50910.251219
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 272
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51082.411552
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 273
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51254.571888
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 274
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51195.326584
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 275
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51018.726699
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 276
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51229.173039
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 277
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50936.771768
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 278
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51207.168069
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 279
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51157.900919
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 280
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51026.967554
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 281
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51191.747378
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 282
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50945.012626
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 283
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51159.764249
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 284
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51120.475256
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 285
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51035.208408
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 286
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51154.321714
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 287
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50940.209719
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 288
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51112.360433
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 289
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51284.511141
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79264.000000
The optimal solution has not been found yet.

Iteration 290
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51183.404520
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 291
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51043.780706
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 292
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51217.206829
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 293
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50961.932677
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 294
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51237.169154
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 295
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51146.027672
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 296
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51052.010813
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 297
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51179.829981
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 298
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50970.162782
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 82147.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 299
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 51189.827165
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79264.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 300
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 51108.650825
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77278.000000
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.
The iteration limit has been reached

TIMINGS:

Total run time for the heuristic = 587547 ms
The total time to calculate the lower bounds with CPLEX = 3010 ms
The total time to calculate the upper bounds with CPLEX = 2540 ms
The total time to create the lower bound problems = 2449 ms
The total time to read the lower bound solutions = 597 ms
The total time to check if computing the upper bounds are needed = 0 ms
The total time to create the upper bound problems = 2103 ms
The total time to read the upper bound solutions = 473 ms 

The best upper bound found = 74208.000000, the best lower bound found = 51284.511141
Therefore the duality gap is 44.698659%
